Image Compression using Approximate Matching and Run Length
نویسندگان
چکیده
Image compression is currently a prominent topic for both military and commercial researchers. Due to rapid growth of digital media and the subsequent need for reduced storage and to transmit the image in an effective manner Image compression is needed. Image compression attempts to reduce the number of bits required to digitally represent an image while maintaining its perceived visual quality. This study concentrates on the lossless compression of image using approximate matching technique and run length encoding. The performance of this method is compared with the available jpeg compression technique over a wide number of images, showing good agreements. Keywordslossless image compression; approximate matching; run length.
منابع مشابه
2D-pattern matching image and video compression: theory, algorithms, and experiments
In this paper, we propose a lossy data compression framework based on an approximate two-dimensional (2D) pattern matching (2D-PMC) extension of the Lempel-Ziv (1977, 1978) lossless scheme. This framework forms the basis upon which higher level schemes relying on differential coding, frequency domain techniques, prediction, and other methods can be built. We apply our pattern matching framework...
متن کاملRectangular Decomposition of Binary Images
The contribution deals with the most important methods for decomposition of binary images into union of rectangles. The overview includes run-length encoding and its generalization, decompositions based on quadtrees, on the distance transformation, and a theoretically optimal decomposition based on maximal matching in bipartite graphs. We experimentally test their performance in binary image co...
متن کاملDecomposition of binary images - A survey and comparison
We present an overview of the most important methods that decompose an arbitrary binary object into a union of rectangles. We describe a run-length encoding and its generalization, decompositions based on quadtrees, on mathematical morphology, on the distance transform, and a theoretically optimal decomposition based on a maximal matching in bipartite graphs. We compare their performance in ima...
متن کاملColour Image Coding with Matching Pursuit in the Spatio-frequency Domain
We present and evaluate a novel idea for scalable lossy colour image coding with Matching Pursuit (MP) performed in a transform domain. The idea is to exploit correlations in RGB colour space between image subbands after wavelet transformation rather than in the spatial domain. We propose a simple quantisation and coding scheme of colour MP decomposition based on Run Length Encoding (RLE) which...
متن کاملVideo Watermarking using Fractal Encoding & RLE Encoding
Compression of the color images and videos has many applications in most of the mobile technologies. Reducing the time taken for file transfer is important in digital communication fields. Image compression means reducing the graphics file size, without degrading the quality of the image. For digital images, Fractal image Compression (FIC) and run length coding has been considered as an efficie...
متن کامل